A Generic Algorithm for Heterogeneous Schema Matching

نویسندگان

  • Weiming Zhang
  • You Li
  • Dongbo Liu
چکیده

Schema matching is a basic problem nowadays in many application areas, such as data integration, data warehouse and e-business. In this paper, we propose a generic schema matching method called GSM (Generic Schema Matching) and its optimizing approaches. GSM provides an extensible library of match algorithms to support multi-strategy matching approach. It also uses a mapping knowledge base to leverage previous matching experiences. Finally, we use GSM on the real world schemas and provide its experimental results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

Matching of Ontologies with XML Schemas Using a Generic Metamodel

Schema matching is the task of automatically computing correspondences between schema elements. A multitude of schema matching approaches exists for various scenarios using syntactic, semantic, or instance information. The schema matching problem is aggravated by the fact that models to be matched are often represented in different modeling languages, e.g. OWL, XML Schema, or SQL DDL. Consequen...

متن کامل

Generic Schema Matching with Cupid

Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past solutions, showing that a rich range of techniques is available. We then propose a new algorithm, Cupid...

متن کامل

Challenges in Precisely Aligning Models of Human Anatomy Using Generic Schema Matching

This paper describes how we used generic schema matching algorithms to align the Foundational Model of Anatomy (FMA) and the GALEN Common Reference Model (CRM), two large models of human anatomy. We summarize the generic schema matching algorithms we used to identify correspondences. We present sample results that highlight the similarities and differences between the FMA and the CRM. We also i...

متن کامل

Generic Schema Matching, Ten Years Later

In a paper published in the 2001 VLDB Conference, we proposed treating generic schema matching as an independent problem. We developed a taxonomy of existing techniques, a new schema matching algorithm, and an approach to comparative evaluation. Since then, the field has grown into a major research topic. We briefly summarize the new techniques that have been developed and applications of the t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006